Two Access Methods Using Compact Binary Trees
نویسندگان
چکیده
منابع مشابه
Compact Trace Trees in Dynamic Binary Translators
Trace Tree (TT) is a technique to collect program execution traces, which is commonly used in JIT environments. Its main features are the ability to perform loop unrolling and function inlining at no cost, while detecting application loop kernels. In this paper we evaluate a TT implementation in a DBT environment. We show that, under DBT, trace trees suffer from severe code duplication, conside...
متن کاملA Genetic Algorithm for Constructing Compact Binary Decision Trees
Abstract Tree-based classifiers are important in pattern recognition and have been well studied. Although the problem of finding an optimal decision tree has received attention, it is a hard optimization problem. Here we propose utilizing a genetic algorithm to improve on the finding of compact, near-optimal decision trees. We present a method to encode and decode a decision tree to and from a ...
متن کاملMeta-Fibonacci Sequences, Binary Trees and Extremal Compact Codes
We consider a family of meta-Fibonacci sequences which arise in studying the number of leaves at the largest level in certain infinite sequences of binary trees, restricted compositions of an integer, and binary compact codes. For this family of meta-Fibonacci sequences and two families of related sequences we derive ordinary generating functions and recurrence relations. Included in these fami...
متن کاملMultidimensional Access Methods: Trees Have Grown Everywhere
This paper is a survey of work and issues on multidimensional search trees. We provide a classification of such methods, we describe the related algorithms, we present performance analysis efforts, and finally outline future research directions. Multi-dimensional search trees and Spatial Access Methods, in general, are designed to handle spatial objects, like points, line segments, polygons, po...
متن کاملA ricle Tests for Two Trees Using Likelihood Methods
This article considers two similar likelihood-based test statistics for comparing two fixed trees, the Kishino-Hasegawa (KH) test statistic and the likelihood ratio (LR) statistic, as well as a number of different methods for determining thresholds to declare a significant result. An explanation is given for why the KH test, which uses the KH test statistic and normal theory thresholds, need no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Software Engineering
سال: 1987
ISSN: 0098-5589
DOI: 10.1109/tse.1987.233491